SOS rule formats for convex and abstract probabilistic bisimulations

نویسندگان

  • Pedro R. D'Argenio
  • Matias David Lee
  • Daniel Gebler
چکیده

Probabilistic transition system specifications (PTSSs) in the ntμfθ/ntμxθ format provide structural operational semantics for Segala-type systems that exhibit both probabilistic and nondeterministic behavior and guarantee that bisimilarity is a congruence for all operator defined in such format. Starting from the ntμfθ/ntμxθ, we obtain restricted formats that guarantee that three coarser bisimulation equivalences are congruences. We focus on (i) Segala’s variant of bisimulation that considers combined transitions, which we call here convex bisimulation; (ii) the bisimulation equivalence resulting from considering Park & Milner’s bisimulation on the usual stripped probabilistic transition system (translated into a labelled transition system), which we call here probability obliterated bisimulation; and (iii) a probability abstracted bisimulation, which, like bisimulation, preserves the structure of the distributions but instead, it ignores the probability values. In addition, we compare these bisimulation equivalences and provide a logic characterization for each of them.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Formats of Ordered SOS Rules with Silent Actions

We present a general and uniform method for deening structural operational semantics (SOS) of process algebra operators by traditional Plotkin-style rules equipped with an ordering, the new feature which states the order of application of rules when deriving transitions of process terms. Our method allows to represent negative premises and copying in the presence of silent actions. We identify ...

متن کامل

SOS-based Modal Decomposition on Nondeterministic Probabilistic Processes

Abstract. We propose a method for the decomposition of modal formulae on processes with nondeterminism and probability with respect to Structural Operational Semantics. The purpose is to reduce the satisfaction problem of a formula for a process to verifying whether its subprocesses satisfy certain formulae obtained from the decomposition. To deal with the probabilistic behavior of processes, a...

متن کامل

Compositionality of Approximate Bisimulation for Probabilistic Systems

Probabilistic transition system specifications using the rule format ntμfθ/ntμxθ provide structural operational semantics for Segala-type systems and guarantee that probabilistic bisimilarity is a congruence. Probabilistic bisimilarity is for many applications too sensitive to the exact probabilities of transitions. Approximate bisimulation provides a robust semantics that is stable with respec...

متن کامل

Ordered SOS Pro ess Languages for Bran hing and Eager Bisimulations

Bran hing and Eager Bisimulations Irek Ulidowski a, Iain Phillips b;1 aDepartment of Mathemati s and Computer S ien e, University of Lei ester, University Road, Lei ester, LE1 7RH, United Kingdom bDepartment of Computing, Imperial College, 180 Queen's Gate, London SW7 2BZ, United Kingdom Abstra t We present a general and uniform method for de ning stru tural operational semanti s (SOS) of pro e...

متن کامل

Probabilistic Bisimulations for PCTL Model Checking of Interval MDPs

Verification of PCTL properties of MDPs with convex uncertainties has been investigated recently by Puggelli et al. However, model checking algorithms typically suffer from state space explosion. In this paper, we address probabilistic bisimulation to reduce the size of such an MDPs while preserving PCTL properties it satisfies. We discuss different interpretations of uncertainty in the models ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015